Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
نویسندگان
چکیده
منابع مشابه
Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
Let P be a set of n points in two dimensional plane. For each point p P ∈ , we locate an axisparallel unit square having one particular side passing through p and enclosing the maximum number of points from P . Considering all points p P ∈ , such n squares can be reported in ( ) O n n log time. We show that this result can be used to (i) locate ( ) m 2 > axis-parallel unit squares which are pai...
متن کاملk-Enclosing Axis-Parallel Square
Let P be a set of n points in the plane. Here an optimization technique is used to solve some optimization problems. A simple deterministic algorithm is proposed to compute smallest square containing at least k points of P . The time and space complexities of the algorithm are O(n log n) and O(n) respectively. For large values of k, the worst case time complexity of the algorithm is O(n + (n − ...
متن کاملSmallest axis-parallel rectangle enclosing at least k points
Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identifies a smallest area axis-parallel rectangle enclosing at least k points of P (1 < k ≤ n). The worst case time and space complexities of the algorithm are O(n) and O(n) respectively.
متن کاملEnclosing K Points in the Smallest Axis Parallel Rectangle
We consider the following clustering problem. Given a set S of n points in the plane, and given an integer k, n 2 < k n, we want to nd the smallest axis parallel rectangle (smallest perimeter or area) that encloses exactly k points of S. We present an algorithm which runs in time O(n + k(n ? k) 2) improving previous algorithms which run in time O(k 2 n) and do not perform well for larger k valu...
متن کاملA parallel multisplitting solution of the least squares problem
The linear least squares problem, minx ‖Ax−b‖2, is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by a sequence of local least squares problems which can be solved in parallel by MS. In MS the solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Computational Mathematics
سال: 2014
ISSN: 2161-1203,2161-1211
DOI: 10.4236/ajcm.2014.43016